Iterative Method for Mirror-symmetric Solution of Matrix Equation Axb + Cy D = E
نویسندگان
چکیده
Mirror-symmetric matrices have important applications in studying odd/even-mode decomposition of symmetric multiconductor transmission lines (MTL). In this paper, we propose an iterative algorithm to solve the mirror-symmetric solution of matrix equation AXB + CY D = E. With it, the solvability of the equation over mirror-symmetric X, Y can be determined automatically. When the equation is consistent, its solution can be obtained within finite iteration steps, and its least-norm mirror-symmetric solution can be obtained by choosing a special kind of initial iteration matrices. Furthermore, the related optimal approximation problem is also solved. Numerical examples are given to show the efficiency of the presented method.
منابع مشابه
An Iterative Method for the Generalized Centro-symmetric Solution of a Linear Matrix Equation Axb + Cy D = E
A matrix P ∈ Rn×n is said to be a symmetric orthogonal matrix if P = P T = P−1. A matrix A ∈ Rn×n is said to be generalized centro-symmetric (generalized central anti-symmetric )with respect to P , if A = PAP (A = −PAP ). In this paper, an iterative method is constructed to solve the generalized centrosymmetric solutions of a linear matrix equation AXB + CY D = E, with real pair matrices X and ...
متن کاملIterative Solutions to Some Linear Matrix Equations
In this paper the gradient based iterative algorithms are presented to solve the following four types linear matrix equations: (a) AXB = F ; (b) AXB = F, CXD = G; (c) AXB = F s. t. X = X ; (d) AXB+CY D = F, where X and Y are unknown matrices, A,B,C,D, F,G are the given constant matrices. It is proved that if the equation considered has a solution, then the unique minimum norm solution can be ob...
متن کاملA new Approximation to the solution of the linear matrix equation AXB = C
It is well-known that the matrix equations play a significant role in several applications in science and engineering. There are various approaches either direct methods or iterative methods to evaluate the solution of these equations. In this research article, the homotopy perturbation method (HPM) will employ to deduce the approximated solution of the linear matrix equation in the form AXB=C....
متن کاملIterative solutions to the linear matrix equation AXB + CXTD = E
In this paper the gradient based iterative algorithm is presented to solve the linear matrix equation AXB +CXD = E, where X is unknown matrix, A,B,C,D,E are the given constant matrices. It is proved that if the equation has a solution, then the unique minimum norm solution can be obtained by choosing a special kind of initial matrices. Two numerical examples show that the introduced iterative a...
متن کامل